The Lagrange multiplier method for Dirichlet’s problem
نویسندگان
چکیده
منابع مشابه
The Lagrange Multiplier Method for Dirichlet's Problem
The Lagrange multiplier method of Babuska for the approximate solution of Dirichlet's problem for second order elliptic equations is reformulated. Based on this formulation, new estimates for the error in the solution and the boundary flux are given. Efficient methods for the solution of the approximate problem are discussed.
متن کاملLagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when performing several personalized campaigns simultaneously. We formulate the multi-campaign assignment problem to solve this issue and propose methods for solving the problem. The most notable element is the Lagrange mult...
متن کاملA Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem
A Lagrange multiplier and Hopfield-type barrier function method is proposed for approximating a solution of the traveling salesman problem. The method is derived from applications of Lagrange multipliers and a Hopfield-type barrier function and attempts to produce a solution of high quality by generating a minimum point of a barrier problem for a sequence of descending values of the barrier par...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMultiple Lagrange Multiplier Method for Constrained Evolutionary Optimization
One of the well-known problems in evolutionary search for solving optimization problem is the premature convergence. The general constrained optimization techniques such as hybrid evolutionary programming, two{phase evolutionary programming, and Evolian algorithms are not safe from the same problem in the rst phase. To overcome this problem, we apply the sharing function to the Evolian algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1981
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1981-0616356-7